A Single–depot Complex Vehicle Routing Problem and its PSO Solution
نویسندگان
چکیده
This paper discusses a single-depot complex vehicle routing problem (SCVRP), of which the conditions are that the total routine shall be the shortest and the biggest marched routine of any single vehicle as well. A single objective model is set up upon these conditions. Accordingly, this paper proposes an improved PSO algorithm (GPSO) combined with the crossover operation of genetic algorithm (GA). It can avoid being trapped in local optimum due to using probability searching. GPSO is applied to SCVRP, and cases testify to its feasibility and effectiveness.
منابع مشابه
An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملSolving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm
A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملبهینه یابی سبد سرویس در مسائل مسیریابی چند سطحی - چند محصولی و چند قرارگاهی وسایل نقلیه با هدف حداقل نمودن هزینههای توزیع
Optimizing the service card in multi-depot, multi-product and multi-level vehicle routing problem is one of the most important and at the same time, the most complex problems in the transportation problems contexts. Numerous exact heuristic and meta-heuristic algorithms have been developed for different vehicle routing problems. In this paper, a binary linear programming (BLP) based model for o...
متن کاملThe fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm
In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...
متن کامل